Approximate forward–backward algorithm for a switching linear Gaussian model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate forward-backward algorithm for a switching linear Gaussian model

Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given this the variables in the second hidden layer are assumed conditionally independent and Gaussian distributed. The observation process is assumed Gaussian with mean values that are linear functions of the second hidden ...

متن کامل

A Novel Gaussian Sum Smoother for Approximate Inference in Switching Linear Dynamical Systems

We introduce a method for approximate smoothed inference in a class of switching linear dynamical systems, based on a novel form of Gaussian Sum smoother. This class includes the switching Kalman Filter and the more general case of switch transitions dependent on the continuous latent state. The method improves on the standard Kim smoothing approach by dispensing with one of the key approximati...

متن کامل

A Semi-Markov Switching Linear Gaussian Model for Censored Physiological Data

Critically ill patients in regular wards are vulnerable to unanticipated clinical deterioration which requires timely transfer to the intensive care unit (ICU). To allow for risk scoring and patient monitoring in such a setting, we develop a novel SemiMarkov Switching Linear Gaussian Model (SSLGM) for the inpatients’ physiology. The model captures the patients’ latent clinical states and their ...

متن کامل

Gaussian Variational Approximate Inference for Generalized Linear Mixed Models

Variational approximation methods have become a mainstay of contemporary Machine Learning methodology, but currently have little presence in Statistics. We devise an effective variational approximation strategy for fitting generalized linear mixed models (GLMM) appropriate for grouped data. It involves Gaussian approximation to the distributions of random effects vectors, conditional on the res...

متن کامل

A linear time algorithm for approximate 2-means clustering

Matousek [Discrete Comput. Geom. 24 (1) (2000) 61–84] designed an O(nlogn) deterministic algorithm for the approximate 2-means clustering problem for points in fixed dimensional Euclidean space which had left open the possibility of a linear time algorithm. In this paper, we present a simple randomized algorithm to determine an approximate 2-means clustering of a given set of points in fixed di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics & Data Analysis

سال: 2011

ISSN: 0167-9473

DOI: 10.1016/j.csda.2010.06.008